A Boolean network control algorithm guided by forward dynamic programming

A Dynamic Boolean Network

We propose a Dynamic Boolean Network in which a state of a Boolean network and an output label associated with the state are interacting with each other, and a transition matrix keeps changing perpetually. We extrapolate a mutation of a transition matrix as T → Q−1TQ where T is a transition matrix and Q is a matrix representation of a permutation P (where the objects permuted are states of DBN)...

Control Network Programming with SPIDER: Dynamic Search Control

The report describes the means for dynamic control of the computation process that are available in Spider – a language for Control Network Programming.

Risk-Constrained Forward Trading Optimization by Stochastic Approximate Dynamic Programming

A Forward-backward Algorithm for Stochastic Control Problems - Using the Stochastic Maximum Principle as an Alternative to Dynamic Programming

An algorithm for solving continuous-time stochastic optimal control problems is presented. The numerical scheme is based on the stochastic maximum principle (SMP) as an alternative to the widely studied dynamic programming principle (DDP). By using the SMP, (Peng, 1990) obtained a system of coupled forwardbackward stochastic differential equations (FBSDE) with an external optimality condition. ...

Robust Process Control by Dynamic Stochastic Programming

Unnecessarily conservative behavior of standard process control techniques can be avoided by stochastic programming models when the distribution of random distur­ bances is known. In an earlier study we have investigated such an approach for tank level constraints of a distillation process. Here we address techniques that have accelerated the numerical solution of the large and expensive stocha...